Merkle–Damgård construction

Results: 76



#Item
11A Practical Limit of Security Proof in the Ideal Cipher Model : Possibility of Using the Constant As a Trapdoor In Several Double Block Length Hash Functions Donghoon Chang Center for Information Security Technologies(CI

A Practical Limit of Security Proof in the Ideal Cipher Model : Possibility of Using the Constant As a Trapdoor In Several Double Block Length Hash Functions Donghoon Chang Center for Information Security Technologies(CI

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2006-12-21 12:10:24
12CIS 331 Introduction to Networks & Security January 23, 2014 Project 1: Attacking Cryptographic Hashes

CIS 331 Introduction to Networks & Security January 23, 2014 Project 1: Attacking Cryptographic Hashes

Add to Reading List

Source URL: www.cis.upenn.edu

Language: English - Date: 2014-11-18 15:19:13
13CS255: Cryptography and Computer Security  Winter 2007 Assignment #2 Due: Friday, Feb. 23, 2007.

CS255: Cryptography and Computer Security Winter 2007 Assignment #2 Due: Friday, Feb. 23, 2007.

Add to Reading List

Source URL: crypto.stanford.edu

Language: English - Date: 2007-02-17 22:43:38
14CS255: Cryptography and Computer Security  Winter 2008 Assignment #2 Due: Friday, Feb. 22, 2008.

CS255: Cryptography and Computer Security Winter 2008 Assignment #2 Due: Friday, Feb. 22, 2008.

Add to Reading List

Source URL: crypto.stanford.edu

Language: English - Date: 2008-02-20 19:40:28
15Notes on the Wang et al. 263 SHA-1 Differential Path Martin Cochran ∗ August 24, 2008 Abstract Although advances in SHA-1 cryptanalysis have been made since the 2005 announcement of

Notes on the Wang et al. 263 SHA-1 Differential Path Martin Cochran ∗ August 24, 2008 Abstract Although advances in SHA-1 cryptanalysis have been made since the 2005 announcement of

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2008-08-25 02:24:24
16Generic collision attacks on narrow-pipe hash functions faster than birthday paradox, applicable to MDx, SHA-1, SHA-2, and SHA-3 narrow-pipe candidates Vlastimil Klima1 and Danilo Gligoroski2 1

Generic collision attacks on narrow-pipe hash functions faster than birthday paradox, applicable to MDx, SHA-1, SHA-2, and SHA-3 narrow-pipe candidates Vlastimil Klima1 and Danilo Gligoroski2 1

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2010-08-04 14:03:01
171  Cryptographic Hash Function EDON-R Presented by Prof. Danilo Gligoroski

1 Cryptographic Hash Function EDON-R Presented by Prof. Danilo Gligoroski

Add to Reading List

Source URL: csrc.nist.gov

Language: English
18Collisions in MD5 Antoine Delignat-Lavaud Collisions in MD5 ... and how to use them for fun and profit.

Collisions in MD5 Antoine Delignat-Lavaud Collisions in MD5 ... and how to use them for fun and profit.

Add to Reading List

Source URL: antoine.delignat-lavaud.fr

Language: English - Date: 2010-08-17 15:48:58
19SHA-3 Standard: Overview, Status, Public Comment

SHA-3 Standard: Overview, Status, Public Comment

Add to Reading List

Source URL: csrc.nist.gov

Language: English - Date: 2014-08-22 14:11:37
20Indifferentiable Security Analysis of Popular Hash Functions with Prefix-free Padding Donghoon Chang1 , Sangjin Lee1 , Mridul Nandi2 , and Moti Yung3 1  Center for Information Security Technologies(CIST), Korea Universit

Indifferentiable Security Analysis of Popular Hash Functions with Prefix-free Padding Donghoon Chang1 , Sangjin Lee1 , Mridul Nandi2 , and Moti Yung3 1 Center for Information Security Technologies(CIST), Korea Universit

Add to Reading List

Source URL: www.iacr.org

Language: English - Date: 2009-03-05 01:27:34